Square Interconnection Network for Data Permutation
نویسنده
چکیده
In this paper a square cellular network for data permutation in a SIMD model is described. It has n=4 2–permuters only, and realizes an arbitrary permutation pattern in two passes. For this network a programming algorithm is provided with O(n) sequential time complexity. Due to its regular cellular structure the square network is suitable for VLSI implementation.
منابع مشابه
Using Group Theory to Specify Application Specific Interconnection Networks for SIMD DSPs
We introduce another view of group theory in the field of interconnection networks. With this approach it is possible to specify application specific network topologies for permutation data transfers. Routing of data transfers is generated and all possible permutation data transfers are guaranteed. We present the approach by means of a kind of SIMD DSP.
متن کاملSimulation of Permutation Passibility of Fault- Tolerant Multistage Interconnection Networks
Fault-tolerance in an interconnection network is very important for its continuous operation over a relatively long period of time. Fault-tolerance is the ability of the system to continue operating in the presence of faults. In this paper a new irregular network IABN has been proposed and fault tolerance and permutation possibility behavior of the network has been analysed. Permutation passibi...
متن کاملFault-Tolerance and Permutation Analysis of ASEN and its Variant
High performance computing systems can be designed using parallel processing. The effectiveness of these parallel systems rests primarily on the communication network linking processors and memory modules. Hence, an interconnection network that provides the desired connectivity and performance at minimum cost is required. The design of a suitable interconnection network for inter-processor comm...
متن کاملHigh-speed crosstalk-free routing for optical multistage interconnection networks
Multistage interconnection networks (MINs) can be used to construct electro-optic switches. To implement crosstalkfree switching in such a switch, two I/O connecting paths cannot share a common switching element (SE). Thus, a permutation must be decomposed into partial permutations, each being routed through the switch without crosstalk. It was shown that any permutation can be decomposed into ...
متن کاملCharacterizing the bit permutation networks obtained from the line digraphs of bit permutation networks
A bit permutation network is an s-stage interconnection network composed of dn−1 d × d crossbar switches in each stage. This class of networks includes most of the multistage interconnection networks. Recently, Chang et al. [Networks 33 (1999), 261–267] showed that an sstage d-nary bit permutation network N with dn inputs (outputs) can be characterized by an (s − 1)-vector (k1, . . . , ks−1), w...
متن کامل